Covering the Plane with Congruent Copies of a Convex Body
نویسنده
چکیده
It is shown that every plane compact convex set /f with an interior point admits a covering of the plane with density smaller than or equal to 8(2\/3 — 3)/3 = 1.2376043 For comparison, the thinnest covering of the plane with congruent circles is of density 2n/\Z21 = 1.209199576... (see R. Kershner [3]), which shows that the covering density bound obtained here is close to the best possible. It is conjectured that the best possible is 2n/y/21. The coverings produced here are of the double-lattice kind consisting of translates of K and translates of — K.
منابع مشابه
Covering the Plane with Congruent Copies of a Convex Disk
It is shown that there exists a number d 0 < 8(2 p 3?3)=3 = 1:237604::, such that every compact convex set K with an interior point admits a covering of the plane with density smaller than or equal to d 0. This improves on the previous result 9], which showed that a density of 8(2 p 3 ? 3)=3 can always be obtained. Since the thinnest covering of the plane with congruent circles is of density 2=...
متن کاملClouds of Planar Convex Bodies
Let fK; K 1 ; : : : ; K n g be a family of convex bodies in the plane. We say that the bodies K 1 ; : : : ; K n form a deep cloud around K if the bodies K; K 1 ; : : : ; K n are mutually non-overlapping and every ray emanating from K intersects the interior of at least one of K 1 ; : : : ; K n. In this paper we are concerned with the following question: What is the minimum number of congruent c...
متن کاملConvexity and Combinatorics
Geir Agnarsson. George Mason University, Fairfax, VA. On Minkowski sum of simplices and their flags. We consider a Minkowski sum of k standard simplices in Rr and its chains of faces, for given k, r ∈ N. We define its flag polynomial in a direct and canonical way in terms of the k-th master polytope P (k). This polynomial is related to the well-known flag vector, and it has some nice algebraic ...
متن کامل2 Packing and Covering
The basic problems in the classical theory of packings and coverings, the development of which was strongly influenced by the geometry of numbers and by crystallography, are the determination of the densest packing and the thinnest covering with congruent copies of a given body K. Roughly speaking, the density of an arrangement is the ratio between the total volume of the members of the arrange...
متن کاملCovering Belt Bodies by Smaller Homothetical Copies
Let b(K) denote the minimal number of smaller homothetical copies of a convex body K ⊂ R, n ≥ 2, covering K. For the class B of belt bodies, which is dense in the set of all convex bodies (in the Hausdorff metric), 3 · 2 is known to be an upper bound on b(K) if K is different from a parallelotope. We will show that (except for all parallelotopes and two particular cases, each satisfying b(K) = ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1989